Termination w.r.t. Q proof of TRS/SK902.48.trs

Termination w.r.t. Q of the following Term Rewriting System could be proven:

Q restricted rewrite system:
The TRS R consists of the following rules:

d(x) → e(u(x))
d(u(x)) → c(x)
c(u(x)) → b(x)
v(e(x)) → x
b(u(x)) → a(e(x))

Q is empty.

↳ QTRS

  ↳ DirectTerminationProof

Q restricted rewrite system:
The TRS R consists of the following rules:

d(x) → e(u(x))
d(u(x)) → c(x)
c(u(x)) → b(x)
v(e(x)) → x
b(u(x)) → a(e(x))

Q is empty.

We use [23] with the following order to prove termination.

Lexicographic path order with status [19].
Quasi-Precedence:

d₁ > u₁
d₁ > c₁ > b₁ > e₁
d₁ > c₁ > b₁ > a₁

Status:

trivial